Sparse approximate inverse preconditioners on high performance GPU platforms
نویسندگان
چکیده
منابع مشابه
Sparse approximate inverse preconditioners on high performance GPU platforms
Simulation with models based on partial differential equations often requires the solution of (sequences of) large and sparse algebraic linear systems. In multidimensional domains, preconditioned Krylov iterative solvers are often appropriate for these duties. Therefore, the search for efficient preconditioners for Krylov subspace methods is a crucial theme. Recent developments, especially in c...
متن کاملWavelet Sparse Approximate Inverse Preconditioners
There is an increasing interest in using sparse approximate inverses as preconditioners for Krylov subspace iterative methods. Recent studies of Grote and Huckle [21] and Chow and Saad [11] also show that sparse approximate inverse preconditioner can be effective for a variety of matrices, e.g. Harwell-Boeing collections. Nonetheless a drawback is that it requires rapid decay of the inverse ent...
متن کاملApproximate Inverse Preconditioners via Sparse-Sparse Iterations
The standard incomplete LU (ILU) preconditioners often fail for general sparse in-deenite matrices because they give rise tòunstable' factors L and U. In such cases, it may be attractive to approximate the inverse of the matrix directly. This paper focuses on approximate inverse preconditioners based on minimizing kI ? AMk F , where AM is the preconditioned matrix. An iterative descent-type met...
متن کاملApproximate Inverse Preconditioners for General Sparse Matrices
The standard Incomplete LU (ILU) preconditioners often fail for general sparse indeenite matrices because they give rise tòunstable' factors L and U. In such cases, it may be attractive to approximate the inverse of the matrix directly. This paper focuses on approximate inverse preconditioners based on minimizing kI?AMk F , where AM is the preconditioned matrix. An iterative descent-type method...
متن کاملOrderings for Factorized Sparse Approximate Inverse Preconditioners
The innuence of reorderings on the performance of factorized sparse approximate inverse preconditioners is considered. Some theoretical results on the eeect of orderings on the ll-in and decay behavior of the inverse factors of a sparse matrix are presented. It is shown experimentally that certain reorderings, like Minimum Degree and Nested Dissection, can be very beneecial both in the precondi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2016
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2015.12.008